Efficient Triangulation-Based Pathfinding

نویسندگان

  • Douglas Demyen
  • Michael Buro
چکیده

Pathfinding for commercial games is a challenging problem, and many existing methods use abstractions which lose details of the environment and compromise path quality. Conversely,ions which lose details of the environment and compromise path quality. Conversely, humans can ignore irrelevant details of an environment that modern search techniques still consider, while maintaining its topography. This thesis describes a technique for extracting features such as dead ends, corridors, and decision points from an environment represented using a constrained Delaunay triangulation. The result is that the pathfinding task is simplified to the point where the search algorithm need only decide to which side of each obstacle to go, while all features of the environment

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Overview of Pathfinding in Navigation Mesh

Pathfinding is a fundamental problem that most commercial games must deal with. Due to the increase in game complexity, early solutions to the problem of pathfinding were soon overwhelmed. A* alone, a classic search algorithm, is no longer sufficient to provide the best solution. The popularization of using navigation mesh in pathfinding makes A* search a very small proportion of pathfinding im...

متن کامل

A Polynomial-Time Algorithm for Non-Optimal Multi-Agent Pathfinding

Multi-agent pathfinding, where multiple agents must travel to their goal locations without getting stuck, has been studied in both theoretical and practical contexts, with a variety of both optimal and sub-optimal algorithms proposed for solving problems. Recent work has shown that there is a lineartime check for whether a multi-agent pathfinding problem can be solved in a tree, however this wa...

متن کامل

Improving Heuristics for Pathfinding in Games

Pathfinding is used extensively in modern computer games: more efficient pathfinding allows for more units and bigger games. Several heuristics already exist to improve the performance beyond that of heuristics as the Manhattan distance when used in the A* search algorithm. In this paper, the new Boundary Heuristic (along with several variants) is introduced in order to attempt to increase the ...

متن کامل

Efficient surface reconstruction from contours based on two-dimensional Delaunay triangulation

This paper introduces an efficient method for surface reconstruction from sectional contours. The surface between neighbouring sections is reconstructed based on the consistent utilization of the twodimensional constrained Delaunay triangulation. The triangulation is used to extract the parametric domain and to solve the problems associated with correspondence, tiling and branching in a general...

متن کامل

Non-Optimal Multi-Agent Pathfinding Is Solved (Since 1984)

Optimal solutions for multi-agent pathfinding problems are often too expensive to compute. For this reason, suboptimal approaches have been widely studied in the literature. Specifically, in recent years a number of efficient suboptimal algorithms that are complete for certain subclasses have been proposed at highly-rated robotics and AI conferences. However, it turns out that the problem of no...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006